Dictionary Machine with Improved Performance
نویسندگان
چکیده
منابع مشابه
High Performance Lossless Multimedia Data Compression through Improved Dictionary
The advent of modern electronic world has opened up various fronts in multimedia interaction. They are used in various fields for various purposes of education, entertainment, research and many more. This has led to storage and retrieval of multimedia content regularly. But due to limitations of current technology the disk space and the transmission bandwidth fall behind in the race with the re...
متن کاملMachine-Readable Dictionary Headwords
(5) The idea behind dictionaries for machine processing and that behind dictionaries that people can thumb through are di erent, so we have to be aware that di erent terms are used. It is often best to include in machine dictionaries even terms that are easy for people to understand and to break down into their key elements. For example, :n6HCf (on duty, at work) and F17nKv (the end of the same...
متن کاملCzech-English Machine Translation Dictionary
We are proposing a format for translation dictionaries suitable for machine translation. The dictionary format is concise and generalizes phrases by introducing rules for morphological generation instead of using simple phrase to phrase mapping. We describe a simple way how to automatically construct our compact entries from a machine-readable dictionary originally intended for human users usin...
متن کاملDictionary Machine on SIMD ArchitecturesMichel
This paper presents an implementation of a dictionary machine on a SIMD architecture. The goal of this study is to propose a practical implementation with good performances, taking into account the SIMD mode of computation. We suggest an elegant solution to the main diiculty, the load balancing problem, and then we analyze experimental results obtained on our machine. R esum e Cet article pr es...
متن کاملImproved bounds for dictionary look-up with one error
Given a dictionary S of n binary strings each of length m, we consider the problem of designing a data structure for S that supports d-queries; given a binary query string q of length m, a d-query reports if there exists a string in S within Hamming distance d of q. We construct a data structure for the case d = 1, that requires space O(n log m) and has query time O(1) in a cell probe model wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1988
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/31.6.490